A multi-deme parallelization of a memetic algorithm for the weight setting problem in OSPF and DEFT
نویسندگان
چکیده
The Internet is divided into Autonomous Systems, which control their intra-domain traffic by using interior gateway protocols. The most common protocol used today is Open Shortest Path First (OSPF). OSPF routes traffic on shortest paths defined by integer link weights. The weight setting problem is to find weights that optimize the resulting traffic, for example to minimize network congestion. A recently proposed protocol called Distributed Exponentially-weighted Flow Splitting (DEFT) sends flow on non-shortest paths, with an exponential penalty for longer paths. Since these problems are hard to solve exactly, several heuristics have been proposed. We propose a parallel, multi-deme version of a memetic algorithm to solve the weight setting problem in DEFT. It consists of a shared memory parallelization of the (single deme) memetic algorithm, as well as instances of the memetic algorithm running in parallel, and migrating solutions among populations according to the island model. Computational results show a reduction of execution time, and an improvement of solution quality compared to the original memetic algorithm.
منابع مشابه
A Memetic Algorithm for OSPF and DEFT routing to minimize network congestion
Interior gateway routing protocols like OSPF (Open Shortest Path First) and DEFT (Distributed ExponentiallyWeighted Flow Splitting) send flow through forward links towards the destination node. OSPF routes only on shortest-weight paths, whereas DEFT sends flow on all forward links, but with an exponential penalty on longer paths. Finding suitable weights for these protocols is known as the weig...
متن کاملA memetic algorithm for the weight setting problem in DEFT
To use interior gateway protocols like OSPF (Open Shortest Path First, [6]), IS-IS (Intermediate SystemIntermediate System), and DEFT (Distributed Exponentially-weighted Flow Splitting, [7]) it is necessary to set the link weights to allow data routing. The problem of finding suitable weights for these protocols is known as the weight setting problem. Examples of objective functions are network...
متن کاملA biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
Interior gateway routing protocols like OSPF (Open Shortest Path First) and DEFT (Distributed Exponentially-Weighted Flow Splitting) send flow through forward links towards the destination node. OSPF routes only on shortest-weight paths, whereas DEFT sends flow on all forward links, but with an exponential penalty on longer paths. Finding suitable weights for these protocols is known as the wei...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملOptimizing Load Balancing Routing Mechanisms with Evolutionary Computation
Link State routing protocols, such as Open Shortest Path First (OSPF), are widely applied to intra-domain routing in todays IP networks. They provide a good scalability without lost of simplicity. A router running OSPF distributes traffic uniformly over Equal-cost Multi-path (ECMP), enabling a better distribution of packets among the existent links. More recently, other load balancing strategie...
متن کامل